Dockless Shared Bicycle Flow Control by Using Kernel Density Estimation Based Clustering
نویسندگان
چکیده
منابع مشابه
Information Theoretic Clustering using Kernel Density Estimation
In recent years, information-theoretic clustering algorithms have been proposed which assign data points to clusters so as to maximize the mutual information between cluster labels and data [1, 2]. Using mutual information for clustering has several attractive properties: it is flexible enough to fit complex patterns in the data, and allows for a principled approach to clustering without assumi...
متن کاملDENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation
The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assigned to clusters by hill climbing, i.e. points going to the same local maximum are put into the same cluster. A disadvantage of Denclue 1.0 is, that the used hill climbing may make unnecessary small steps in the beginnin...
متن کاملFast Kernel-density-based Classification and Clustering Using P-trees
..................................................................................................................... iii . ACKNOWLEDGMENTS .................................................................................................. iv . LIST OF TABLES .............................................................................................................. ix . LIST OF FIGURES .........
متن کاملShared kernel models for class conditional density estimation
We present probabilistic models which are suitable for class conditional density estimation and can be regarded as shared kernel models where sharing means that each kernel may contribute to the estimation of the conditional densities of an classes. We first propose a model that constitutes an adaptation of the classical radial basis function (RBF) network (with full sharing of kernels among cl...
متن کاملDensity and Non-Grid based Subspace Clustering via Kernel Density Estimation
Instead of finding clusters in full data space, subspace clustering has been an emergent task which aims at discovering clusters embedded in subspaces. Most of the previous works in the literature are grid and density based approaches, where the performance of clustering algorithms heavily depends on the partition of grids which may incur the serious loss of the real data distribution. In order...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Technology Innovation
سال: 2021
ISSN: 2518-2994,2415-0436
DOI: 10.46604/aiti.2021.6666